9,676 research outputs found

    Straight-line Drawability of a Planar Graph Plus an Edge

    Full text link
    We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The characterization enables a linear-time testing algorithm to determine whether an almost-planar graph admits a straight-line drawing, and a linear-time drawing algorithm that constructs such a drawing, if it exists. We also show that some almost-planar graphs require exponential area for a straight-line drawing

    PRS5 IMPACT OF TOBACCO SMOKE EXPOSURE ON EXACERBATION FREQUENCY, SEVERITY, AND INHALER USE IN ASTHMATIC CHILDREN

    Get PDF

    Can we improve the identification of cold homes for targeted home energy-efficiency improvements?

    Get PDF
    Objective: To investigate the extent to which homes with low indoor-temperatures can be identified from dwelling and household characteristics.Design: Analysis of data from a national survey of dwellings, occupied by low-income households, scheduled for home energy-efficiency improvements. Setting: Five urban areas of England: Birmingham, Liverpool, Manchester, Newcastle and Southampton.Methods: Half-hourly living-room temperatures were recorded for two to four weeks in dwellings over the winter periods November to April 2001-2002 and 2002-2003. Regression of indoor on outdoor temperatures was used to identify cold-homes in which standardized daytime living-room and/ or nighttime bedroom-temperatures were < 16 degrees C (when the outdoor temperature was 5 degrees C). Tabulation and logistic regression were used to examine the extent to which these cold-homes can be identified from dwelling and household characteristics.Results: Overall, 21.0% of dwellings had standardized daytime living-room temperatures < 16 degrees C and 46.4% had standardized nighttime bedroom-temperatures below the same temperature. Standardized indoor-temperatures were influenced by a wide range of household and dwelling characteristics, but most strongly by the energy efficiency (SAP) rating and by standardized heating costs. However, even using these variables, along with other dwelling and household characteristics in a multi-variable prediction model, it would be necessary to target more than half of all dwellings in our sample to ensure at least 80% sensitivity for identifying dwellings with cold living-room temperatures. An even higher proportion would have to be targeted to ensure 80% sensitivity for identifying dwellings with cold-bedroom temperatures.Conclusion: Property and household characteristics provide only limited potential for identifying dwellings where winter indoor temperatures are likely to be low, presumably because of the multiple influences on home heating, including personal choice and behaviour. This suggests that the highly selective targeting of energy-efficiency programmes is difficult to achieve if the primary aim is to identify dwellings with cold-indoor-temperatures. (c) 2006 Published by Elsevier Ltd

    Observation of ion gettering effect in high temperature superconducting oxide material

    Get PDF
    Ion gettering effect has been observed in high-temperature superconducting YBa2Cu3O7 material. Silicon ions were implanted into the material and subsequent high-temperature annealing produced ion movement from a low concentration region to a higher concentration region where the damage of the crystal structure is severe. This gettering effect could be used to make a superconductor-nonsuperconductor-superconductor trilayer structure within a single YBCO film.published_or_final_versio

    β\beta-Stars or On Extending a Drawing of a Connected Subgraph

    Full text link
    We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges. We define the notion of star complexity of a polygon and show that a drawing ΓH\Gamma_H of an induced connected subgraph HH can be extended with at most min{h/2,β+log2(h)+1}\min\{ h/2, \beta + \log_2(h) + 1\} bends per edge, where β\beta is the largest star complexity of a face of ΓH\Gamma_H and hh is the size of the largest face of HH. This result significantly improves the previously known upper bound of 72V(H)72|V(H)| [5] for the case where HH is connected. We also show that our bound is worst case optimal up to a small additive constant. Additionally, we provide an indication of complexity of the problem of testing whether a star-shaped inner face can be extended to a straight-line drawing of the graph; this is in contrast to the fact that the same problem is solvable in linear time for the case of star-shaped outer face [9] and convex inner face [13].Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018

    Beyond Outerplanarity

    Full text link
    We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with nice convex drawings: outer kk-planar graphs, where each edge is crossed by at most kk other edges; and, outer kk-quasi-planar graphs where no kk edges can mutually cross. We show that the outer kk-planar graphs are (4k+1+1)(\lfloor\sqrt{4k+1}\rfloor+1)-degenerate, and consequently that every outer kk-planar graph can be (4k+1+2)(\lfloor\sqrt{4k+1}\rfloor+2)-colored, and this bound is tight. We further show that every outer kk-planar graph has a balanced separator of size O(k)O(k). This implies that every outer kk-planar graph has treewidth O(k)O(k). For fixed kk, these small balanced separators allow us to obtain a simple quasi-polynomial time algorithm to test whether a given graph is outer kk-planar, i.e., none of these recognition problems are NP-complete unless ETH fails. For the outer kk-quasi-planar graphs we prove that, unlike other beyond-planar graph classes, every edge-maximal nn-vertex outer kk-quasi planar graph has the same number of edges, namely 2(k1)n(2k12)2(k-1)n - \binom{2k-1}{2}. We also construct planar 3-trees that are not outer 33-quasi-planar. Finally, we restrict outer kk-planar and outer kk-quasi-planar drawings to \emph{closed} drawings, where the vertex sequence on the boundary is a cycle in the graph. For each kk, we express closed outer kk-planarity and \emph{closed outer kk-quasi-planarity} in extended monadic second-order logic. Thus, closed outer kk-planarity is linear-time testable by Courcelle's Theorem.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

    Seed-layer mediated orientation evolution in dielectric Bi-Zn-Ti-Nb-O thin films

    Get PDF
    Highly (hhh) -oriented pyrochlore Bi-Zn-Ti-Nb-O (BZTN) thin films were fabricated via metal-organic decomposition using orientation template layers. The preferred orientation was ascribed to the interfacial layer, the lattice parameter of which is similar to BZTN. High-resolution transmission electron microscopy supported that the interfacial layer consists of Bi and Pt. The (hhh) -oriented thin films exhibited a highly insulating nature enabling feasible applications in electronic devices, particularly voltage tunable application. The BZTN thin films did not show any apparent dielectric anisotropy and the slightly enhanced dielectric properties were discussed in connection to the internal stress and the grain boundary effect. © 2007 American Institute of Physics

    Methods for determining the optimal arrangement of water deluge systems on offshore installations

    Get PDF
    Offshore installations are prone to fire and/or explosion accidents. Fires have particularly serious consequences due to their high temperatures and heat flux, which affect humans, structures and environments alike. Due to the hydrocarbon explosions caused by delayed ignition following gas dispersion, fires can be the result of immediate ignition after gas release. Accordingly, it can be difficult to decrease their frequency, which is an element of risk (risk=frequency×consequence), using an active protection system (APS) such as gas detectors capable of shutting down the operation. Thus, it is more efficient to reduce the consequence using a passive protection system (PSS) such as water spray. It is important to decide the number and location of water deluge systems, thus the aim of this study is to introduce a new procedure for optimising the locations of water deluge systems using the water deluge location index (WLI) proposed herein. The locations of water deluge systems are thus optimised based on the results of credible fire scenarios using a three-dimensional computational fluid dynamics (CFD) tool. The effects of water spray and the effectiveness of the WLI are investigated in comparison with uniformly distributed sprays
    corecore